Solving Linear Boolean Programming Problems with Imprecise Costs
نویسنده
چکیده
Linear Programming problems with discrete 0-1 variables are of utmost importance in many fields as, e.g., those related to Artificial Intelligence, Operations Research and Management. The main aim of this paper is to present the Fuzzy Linear Boolean Programming problem with fuzzy costs and propose different approaches solving it. These approaches are based on methods for ranking fuzzy numbers, and on the use of the Decomposition Theorem for fuzzy sets which provides a fuzzy solution to the problem.
منابع مشابه
Relation Between Imprecise DESA and MOLP Methods
It is generally accepted that Data Envelopment Analysis (DEA) is a method for indicating efficiency. The DEA method has many applications in the field of calculating the relative efficiency of Decision Making Units (DMU) in explicit input-output environments. Regarding imprecise data, several definitions of efficiency can be found. The aim of our work is showing an equivalence relation between ...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملApplying possibilistic linear programming to aggregate production planning
This work presents a novel interactive possibilistic linear programming (PLP) approach for solving the multiproduct aggregate production planning (APP) problem with imprecise forecast demand, related operating costs, and capacity. The proposed approach attempts to minimize total costs with reference to inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, ...
متن کامل